Clustering of Imperfect Transcripts Using a Novel Similarity Measure
Identifieur interne : 001926 ( Main/Exploration ); précédent : 001925; suivant : 001927Clustering of Imperfect Transcripts Using a Novel Similarity Measure
Auteurs : Oktay Ibrahimov [États-Unis] ; Ishwar Sethi [États-Unis] ; Nevenka Dimitrova [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2002.
Abstract
Abstract: There has been a surge of interest in the last several years in methods for automatic generation of content indices for multimedia documents, particularly with respect to video and audio documents. As a result, there is much interest in methods for analyzing transcribed documents from audio and video broadcasts and telephone conversations and messages. The present paper deals with such an analysis by presenting a clustering technique to partition a set of transcribed documents into different meaningful topics. Our method determines the intersection between matching transcripts, evaluates the information contribution by each transcript, assesses the information closeness of overlapping words and calculates similarity based on Chi-square method. The main novelty of our method lies in the proposed similarity measure that is designed to withstand the imperfections of transcribed documents. Experimental results using documents of varying quality of transcription are presented to demonstrate the efficacy of the proposed methodology.
Url:
DOI: 10.1007/3-540-45637-6_3
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000F81
- to stream Istex, to step Curation: 000F33
- to stream Istex, to step Checkpoint: 001040
- to stream Main, to step Merge: 001A06
- to stream Main, to step Curation: 001926
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Clustering of Imperfect Transcripts Using a Novel Similarity Measure</title><author><name sortKey="Ibrahimov, Oktay" sort="Ibrahimov, Oktay" uniqKey="Ibrahimov O" first="Oktay" last="Ibrahimov">Oktay Ibrahimov</name></author><author><name sortKey="Sethi, Ishwar" sort="Sethi, Ishwar" uniqKey="Sethi I" first="Ishwar" last="Sethi">Ishwar Sethi</name></author><author><name sortKey="Dimitrova, Nevenka" sort="Dimitrova, Nevenka" uniqKey="Dimitrova N" first="Nevenka" last="Dimitrova">Nevenka Dimitrova</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:7EA40EB957EF93774CF05816C934DCA0108E7DB2</idno><date when="2002" year="2002">2002</date><idno type="doi">10.1007/3-540-45637-6_3</idno><idno type="url">https://api.istex.fr/document/7EA40EB957EF93774CF05816C934DCA0108E7DB2/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000F81</idno><idno type="wicri:Area/Istex/Curation">000F33</idno><idno type="wicri:Area/Istex/Checkpoint">001040</idno><idno type="wicri:doubleKey">0302-9743:2002:Ibrahimov O:clustering:of:imperfect</idno><idno type="wicri:Area/Main/Merge">001A06</idno><idno type="wicri:Area/Main/Curation">001926</idno><idno type="wicri:Area/Main/Exploration">001926</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Clustering of Imperfect Transcripts Using a Novel Similarity Measure</title><author><name sortKey="Ibrahimov, Oktay" sort="Ibrahimov, Oktay" uniqKey="Ibrahimov O" first="Oktay" last="Ibrahimov">Oktay Ibrahimov</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Michigan</region></placeName><wicri:cityArea>Intelligent Information Engineering Laboratory Department of Computer Science and Engineering, Oakland University, 48309, Rochester</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Sethi, Ishwar" sort="Sethi, Ishwar" uniqKey="Sethi I" first="Ishwar" last="Sethi">Ishwar Sethi</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Michigan</region></placeName><wicri:cityArea>Intelligent Information Engineering Laboratory Department of Computer Science and Engineering, Oakland University, 48309, Rochester</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Dimitrova, Nevenka" sort="Dimitrova, Nevenka" uniqKey="Dimitrova N" first="Nevenka" last="Dimitrova">Nevenka Dimitrova</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">État de New York</region></placeName><wicri:cityArea>Philips Research, 345 Scarborough Road, 10510-2099, Briarcliff Manor</wicri:cityArea></affiliation><affiliation><wicri:noCountry code="no comma">E-mail: nevenka.dimitrova@philips.com</wicri:noCountry></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2002</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">7EA40EB957EF93774CF05816C934DCA0108E7DB2</idno><idno type="DOI">10.1007/3-540-45637-6_3</idno><idno type="ChapterID">3</idno><idno type="ChapterID">Chap3</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: There has been a surge of interest in the last several years in methods for automatic generation of content indices for multimedia documents, particularly with respect to video and audio documents. As a result, there is much interest in methods for analyzing transcribed documents from audio and video broadcasts and telephone conversations and messages. The present paper deals with such an analysis by presenting a clustering technique to partition a set of transcribed documents into different meaningful topics. Our method determines the intersection between matching transcripts, evaluates the information contribution by each transcript, assesses the information closeness of overlapping words and calculates similarity based on Chi-square method. The main novelty of our method lies in the proposed similarity measure that is designed to withstand the imperfections of transcribed documents. Experimental results using documents of varying quality of transcription are presented to demonstrate the efficacy of the proposed methodology.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>Michigan</li><li>État de New York</li></region></list><tree><country name="États-Unis"><region name="Michigan"><name sortKey="Ibrahimov, Oktay" sort="Ibrahimov, Oktay" uniqKey="Ibrahimov O" first="Oktay" last="Ibrahimov">Oktay Ibrahimov</name></region><name sortKey="Dimitrova, Nevenka" sort="Dimitrova, Nevenka" uniqKey="Dimitrova N" first="Nevenka" last="Dimitrova">Nevenka Dimitrova</name><name sortKey="Ibrahimov, Oktay" sort="Ibrahimov, Oktay" uniqKey="Ibrahimov O" first="Oktay" last="Ibrahimov">Oktay Ibrahimov</name><name sortKey="Sethi, Ishwar" sort="Sethi, Ishwar" uniqKey="Sethi I" first="Ishwar" last="Sethi">Ishwar Sethi</name><name sortKey="Sethi, Ishwar" sort="Sethi, Ishwar" uniqKey="Sethi I" first="Ishwar" last="Sethi">Ishwar Sethi</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001926 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001926 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:7EA40EB957EF93774CF05816C934DCA0108E7DB2
|texte= Clustering of Imperfect Transcripts Using a Novel Similarity Measure
}}
| This area was generated with Dilib version V0.6.32. |  |